The 1/3-2/3 Conjecture for N-Free Ordered Sets
نویسنده
چکیده
A balanced pair in an ordered set P = (V,6) is a pair (x, y) of elements of V such that the proportion of linear extensions of P that put x before y is in the real interval [1/3, 2/3]. We prove that every finite N -free ordered set which is not totally ordered has a balanced pair.
منابع مشابه
On the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملThe proof of a conjecture of Bouabdallah and Sotteau
Let G be a connected graph of order n. A routing in G is a set of n(n 1) fixed paths for all ordered pairs of vertices of G. The edge-forwarding index of G, (G), is the minimum of the maximum number of paths specified by a routing passing through any edge ofG taken over all routings in G, and ,n is the minimum of (G) taken over all graphs of order nwith maximum degree at most . To determine n 2...
متن کاملLarge Cross-Free Sets in Steiner Triple Systems
A cross-free set of size m in a Steiner triple system (V,B) is three pairwise disjoint melement subsets X1, X2, X3 ⊂ V such that no B ∈ B intersects all the three Xi -s. We conjecture that for every admissible n there is an STS(n) with a cross-free set of size n−3 3 which if true, is best possible. We prove this conjecture for the case n = 18k + 3, constructing an STS(18k + 3) containing a cros...
متن کاملCounting independent sets in triangle-free graphs
Ajtai, Komlós, and Szemerédi proved that for sufficiently large t every trianglefree graph with n vertices and average degree t has an independent set of size at least n 100t log t. We extend this by proving that the number of independent sets in such a graph is at least 2 1 2400 n t log . This result is sharp for infinitely many t, n apart from the constant. An easy consequence of our result i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012